Implementation of Recursive Structural Parser for Symbolic Computation using Mathematical Pseudo Language and Features of Java
نویسندگان
چکیده
Symbolic Computation is a Computer Algebra System (CAS) which is developed to compute the symbolic mathematical expressions consisting simple or complex calculations. Symbolic Computation provides the interface to provide input expression in a typical mathematical format. Mathematical problems related to algebra, logarithm, roots, sum & product of series etc can be solved using this package. Use of Object Oriented programming on JAVA platform provides an efficient method to such calculations. GUI components like Panels, Applets, Menus, and Buttons from AWT package are used to make the GUI simple and user friendly. The GUI is made in such a way that it takes input in a typical mathematical format which is helpful for anyone to compute expressions without using complex instructions or commands. This paper represents a strong yet simple way to solve mathematical problems by representing expressions using Symbols and characters with the concept of pseudo language.
منابع مشابه
Modular and Extensible Parser Implementation using Mixins (DRAFT)
This paper describes a method to construct highly modular and extensible recursive descent parser. This parser is used in an extensible Java preprocessor, EPP. EPP can be extended by adding plug-ins which extend Java syntax and add new language features. The EPP's parser consists of small mixins. A recursive descent parser class is constructed by composing these mixins. The syntax accepted by t...
متن کاملFeature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملAddressed term rewriting systems: application to a typed object calculus
We present a formalism called Addressed Term Rewriting Systems, which can be used to model implementations of theorem proving, symbolic computation, and programming languages, especially aspects of sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, and as an example we present a language c...
متن کاملLazy Functional Parser Combinators in Java
A parser is a program that checks if a text is a sentence of the language as described by a grammar. Traditionally, the program text of a parser is generated from a grammar description, after which it is compiled and subsequently run. The language accepted by such a parser is, by the nature of this process, hardcoded in the program. Another approach, primarily taken in the context of functional...
متن کاملSymbolic Script Programming for Java
Computer algebra in Java is a promising field of development. It has not yet reached an industrial strength, in part because of a lack of good user interfaces. Using a general purpose scripting language can bring a natural mathematical notation, akin to the one of specialized interfaces included in most computer algebra systems. We present such an interface for Java computer algebra libraries, ...
متن کامل